Double Depth First Search Based Parametric Analysis for Parametric Time-Interval Automata
نویسندگان
چکیده
منابع مشابه
Double Depth First Search Based Parametric Analysis for Parametric Time-Interval Automata
In this paper, we propose a parametric model checking algorithm for a subclass of Timed Automata called Parametric Time-Interval Automata(PTIA). In a PTIA, we can specify upperand lower-bounds of the execution time (time-interval) of each transition using parameter variables. The proposed algorithm takes two inputs, a model described in a PTIA and a property described in a PTIA accepting all in...
متن کاملParametric Real-Time System Feasibility Analysis Using Parametric Timed Automata
Real-time applications are playing an increasingly significant role in our life. The cost and risk involved in their design leads to the need for a correct and robust modelling of the system before its deployment. Many approaches have been proposed to verify the schedulability of real-time task system. A frequent limitation is that they force the task activation to restrictive patterns (e.g. pe...
متن کاملA Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
In the development of real-time (communicating) hardware or embedded-software systems, it is frequently the case that we want to refine/optimize the system’s internal behavior while preserving the external timed I/O behavior (that is, the interface protocol). In such a design refinement, modification of the systems’ internal branching structures, as well as re-scheduling of internal actions, ma...
متن کاملA Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
In the development of real-time communicating hardware/embedded-software systems, it is frequently the case that we want to refine/optimize the system’s internal behavior while preserving the external timed I/O behavior. In such a design refinement, modification of the systems’ internal branching structures, as well as re-scheduling of internal actions, may frequently occur. Our goal is, then, ...
متن کاملParametric Interrupt Timed Automata
Parametric reasoning is particularly relevant for timed models, but very often leads to undecidability of reachability problems. We propose a parametrised version of Interrupt Timed Automata (an expressive model incomparable to Timed Automata), where polynomials of parameters can occur in guards and updates. We prove that different reachability problems, including robust reachability, are decid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2005
ISSN: 0916-8508,1745-1337
DOI: 10.1093/ietfec/e88-a.11.3007